首页> 外文OA文献 >BDDC and FETI-DP algorithms with adaptive coarse spaces for three-dimensional elliptic problems with oscillatory and high contrast coefficients
【2h】

BDDC and FETI-DP algorithms with adaptive coarse spaces for three-dimensional elliptic problems with oscillatory and high contrast coefficients

机译:具有自适应粗空间的BDDC和FETI-Dp算法   具有振荡和高对比度的三维椭圆问题   系数

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

BDDC and FETI-DP algorithms are developed for three-dimensional ellipticproblems with adaptively enriched coarse components. It is known that theseenriched components are necessary in the development of robust preconditioners.To form the adaptive coarse components, carefully designed generalizedeigenvalue problems are introduced for each faces and edges, and the coarsecomponents are formed by using eigenvectors with their correspondingeigenvalues larger than a given tolerance $\lambda_{TOL}$. Upper bounds forcondition numbers of the preconditioned systems are shown to be $C\lambda_{TOL}$, with the constant $C$ depending only on the maximum number ofedges and faces per subdomain, and the maximum number of subdomains sharing anedge. Numerical results are presented to test the robustness of the proposedapproach.
机译:BDDC和FETI-DP算法针对具有自适应丰富的粗成分的三维椭圆问题而开发。众所周知,这些丰富的成分对于鲁棒预处理器的开发是必不可少的。为了形成自适应粗成分,对每个面和边引入精心设计的广义特征值问题,并使用特征值大于相应给定容限的特征向量来形成粗成分$ \ lambda_ {TOL} $。预处理系统的条件数的上限显示为$ C \ lambda_ {TOL} $,常数$ C $仅取决于每个子域的边和面的最大数量,以及共享边的子域的最大数量。数值结果表明了该方法的鲁棒性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号